Order types of models of reducts of Peano Arithmetic and their fragments
نویسندگان
چکیده
It is well-known that non-standard models of Peano Arithmetic have order type N+Z ·D where D is a dense linear order without first or last element. Not every order of the form N+Z ·D is the order type of a model of Peano Arithmetic, though; in general, it is not known how to characterise those D for which this is the case. In this paper, we consider syntactic fragments of Peano Arithmetic (both with and without induction) and study the order types of their non-standard models. (August 4, 2017)
منابع مشابه
On order-types of models of arithmetic
Synopsis In this thesis we study a range of questions related to the order structure of models of first-order Peano Arithmetic. In Chapter 1 we give necessary definitions and describe the current state of the subject in the literature survey. In Chapter 2 we study first properties of order-types of models of PA, give examples and place first restrictions on what the order-type of a model of PA ...
متن کاملUniform Proof Complexity
We define the notion of the uniform reduct of a propositional proof system as the set of those bounded formulas in the language of Peano Arithmetic which have polynomial size proofs under the Paris-Wilkietranslation. With respect to the arithmetic complexity of uniform reducts, we show that uniform reducts are Π1-hard and obviously in Σ2. We also show under certain regularity conditions that ea...
متن کاملReflection principles and provability algebras in formal arithmetic
We study reflection principles in fragments of Peano arithmetic and their applications to the questions of comparison and classification of arithmetical theories. Bibliography: 95 items.
متن کاملThe minimal e-degree problem in fragments of Peano arithmetic
We study the minimal enumeration degree (e-degree) problem in models of fragments of Peano arithmetic (PA) and prove the following results: In any model M of Σ2 induction, there is a minimal enumeration degree if and only if M is a nonstandard model. Furthermore, any cut in such a model has minimal e-degree. By contrast, this phenomenon fails in the absence of Σ2 induction. In fact, whether eve...
متن کاملMODELS OF Th(N) ARE IPs OF NICE RCFs
Exploring further the connection between exponentiation on real closed fields and the existence of an integer part modelling strong fragments of arithmetic, we demonstrate that each model of true arithmetic is an integer part of an exponential real closed field that is elementary equivalent to the reals with exponentiation and that each model of Peano arithmetic is an integer part of a real clo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017